Lecture 23 : Pseudorandomness from Worst - Case Hardness
نویسندگان
چکیده
In the previous lecture, we discussed how to construct pseudorandom generators for any particular class given the existence of a function f with high average-case hardness for that class, and gave an explicit construction for the class Cr. In this lecture, we will finish the proof of its correctness, and also show that we can relax the hardness assumption we need from average-case to worst-case hardness, so that the function f only needs to be difficult to compute at one point, as opposed to many points.
منابع مشابه
Cs 880: Advanced Complexity Theory Lecture 13: Average-case Hardness 1 Worst-case vs. Average-case Complexity
In this lecture and the next two lectures we study hardness amplification, in which the goal is to take a mildly average-case hard function from some class and construct another function in that class that is very average-case hard. Today we prove a lemma that roughly states that every average-case hard function has a set of inputs that encapsulates the hardness of that function in a certain se...
متن کاملPositive Applications of Lattices to Cryptography
We describe constructions of several cryptographic primitives, including hash functions, public key cryptosystems, pseudo-random bit generators, and digital signatures, whose security depends on the assumed worst-case or average-case hardness of problems involving lattices.
متن کاملHardness vs. Randomness within Alternating Time
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1} → {0, 1} that is mildly hard on average, i.e. every circuit of size 2 fails to compute f on at least a 1/poly(l) fraction of inputs, we can build a PRG : {0, 1} n) → {0, 1} computable in ATIME (O(1), log n) = alternating time O(lo...
متن کاملWorst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs
Up to now, the known derandomization methods for BPP have been derived assuming the existence of an ExP function that has a "hard" average-case circuit complexity. In this paper we instead present the first construction of a de-randomization method for BOP that relies on the existence of an EXP function that is hard only in the worst-case. The construction is based on a new method that departs ...
متن کاملOn the Hardness of Learning With Errors with Binary Secrets
We give a simple proof that the decisional Learning With Errors (LWE) problem with binary secrets is at least as hard as the standard LWE problem (with unrestricted, uniformly random secrets). This proves that the binary-secret LWE distribution is pseudorandom, under standard worst-case complexity assumptions on lattice problems. Our results are similar to those proved by (Brakerski, Langlois, ...
متن کامل